Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
271	Generalised matching Raphael Clifford1 , Aram W. Harrow2 , Alexandru Popa1 , and Benjamin Sach1 1 Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 NP-complete problems Analysis of algorithms Time complexity Pattern matching NP Matching Boolean satisfiability problem Theoretical computer science Computational complexity theory Applied mathematics
272	A Generalization of SAT and #SAT for Robust Policy Evaluation∗ Erik Zawadzki Andr´e Platzer Geoffrey J. Gordon Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2013-11-06 19:31:44 Boolean algebra NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean satisfiability problem True quantified Boolean formula Interpretation Constraint satisfaction problem Theoretical computer science Computational complexity theory Applied mathematics
273	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems Add to Reading List Source URL: theoryofcomputing.org Language: English - Date: 2013-06-15 12:40:47 Probability theory NP-complete problems Logic in computer science Elementary mathematics NP-hard problems MAX-3SAT Boolean satisfiability problem Interpretation Belief propagation Mathematics Theoretical computer science Applied mathematics
274	3 Complexity of Reasoning Francesco M. Donini Add to Reading List Source URL: www.inf.unibz.it Language: English - Date: 2011-09-08 09:53:48 Complexity classes Finite model theory Boolean algebra Predicate logic Boolean satisfiability problem True quantified Boolean formula NP-complete Description logic FO Theoretical computer science Computational complexity theory Applied mathematics
275	A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations ⋆ Ajith K John1 and Supratik Chakraborty2 1 2 Add to Reading List Source URL: www.cse.iitb.ac.in Language: English - Date: 2012-06-17 16:38:49 Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean algebra Lookup table Satisfiability Modulo Theories FO Boolean satisfiability problem Theoretical computer science Logic Mathematical logic
276	An ExpTime Tableau-based Decision Procedure for ALCQI Yu Ding and Volker Haarslev Concordia University, Montreal, Canada 1 Add to Reading List Source URL: www.ceur-ws.org Language: English - Date: 2007-05-22 01:39:22 Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Algebraic structure Decision problem Algebra Mathematics Theoretical computer science Mathematical logic
277	CSPs Classical results Semi-Definite programming Inapproximability results Classification Final words Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:56:24 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
278	Pinpointing in the Description Logic EL Franz Baader1, Rafael Pe˜ naloza2⋆ , and Boontawee Suntisrivaraporn1 1 Theoretical Computer Science, TU Dresden, Germany Add to Reading List Source URL: www.ceur-ws.org Language: English - Date: 2007-05-22 01:39:22 Ontology Mathematical logic Abox Function Tbox Algorithm Axiom Boolean satisfiability problem Time complexity Mathematics Theoretical computer science Applied mathematics
279	Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics Add to Reading List Source URL: ijcai.org Language: English - Date: 2013-07-25 05:33:36 Constraint satisfaction problem Local consistency FO Boolean satisfiability problem Decomposition method Complexity of constraint satisfaction Theoretical computer science Constraint programming Applied mathematics
280	Extracting a DPLL Algorithm Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2012-10-25 13:49:14 Logic in computer science Formal methods Automated theorem proving Proof theory Deduction Curry–Howard correspondence Symbol Entailment Boolean satisfiability problem Theoretical computer science Logic Mathematics

UPDATE